178 research outputs found
DeepKSPD: Learning Kernel-matrix-based SPD Representation for Fine-grained Image Recognition
Being symmetric positive-definite (SPD), covariance matrix has traditionally
been used to represent a set of local descriptors in visual recognition. Recent
study shows that kernel matrix can give considerably better representation by
modelling the nonlinearity in the local descriptor set. Nevertheless, neither
the descriptors nor the kernel matrix is deeply learned. Worse, they are
considered separately, hindering the pursuit of an optimal SPD representation.
This work proposes a deep network that jointly learns local descriptors,
kernel-matrix-based SPD representation, and the classifier via an end-to-end
training process. We derive the derivatives for the mapping from a local
descriptor set to the SPD representation to carry out backpropagation. Also, we
exploit the Daleckii-Krein formula in operator theory to give a concise and
unified result on differentiating SPD matrix functions, including the matrix
logarithm to handle the Riemannian geometry of kernel matrix. Experiments not
only show the superiority of kernel-matrix-based SPD representation with deep
local descriptors, but also verify the advantage of the proposed deep network
in pursuing better SPD representations for fine-grained image recognition
tasks
Towards ultra-high resolution 3D reconstruction of a whole rat brain from 3D-PLI data
3D reconstruction of the fiber connectivity of the rat brain at microscopic
scale enables gaining detailed insight about the complex structural
organization of the brain. We introduce a new method for registration and 3D
reconstruction of high- and ultra-high resolution (64 m and 1.3 m
pixel size) histological images of a Wistar rat brain acquired by 3D polarized
light imaging (3D-PLI). Our method exploits multi-scale and multi-modal 3D-PLI
data up to cellular resolution. We propose a new feature transform-based
similarity measure and a weighted regularization scheme for accurate and robust
non-rigid registration. To transform the 1.3 m ultra-high resolution data
to the reference blockface images a feature-based registration method followed
by a non-rigid registration is proposed. Our approach has been successfully
applied to 278 histological sections of a rat brain and the performance has
been quantitatively evaluated using manually placed landmarks by an expert.Comment: 9 pages, Accepted at 2nd International Workshop on Connectomics in
NeuroImaging (CNI), MICCAI'201
Statistically Motivated Second Order Pooling
Second-order pooling, a.k.a.~bilinear pooling, has proven effective for deep
learning based visual recognition. However, the resulting second-order networks
yield a final representation that is orders of magnitude larger than that of
standard, first-order ones, making them memory-intensive and cumbersome to
deploy. Here, we introduce a general, parametric compression strategy that can
produce more compact representations than existing compression techniques, yet
outperform both compressed and uncompressed second-order models. Our approach
is motivated by a statistical analysis of the network's activations, relying on
operations that lead to a Gaussian-distributed final representation, as
inherently used by first-order deep networks. As evidenced by our experiments,
this lets us outperform the state-of-the-art first-order and second-order
models on several benchmark recognition datasets.Comment: Accepted to ECCV 2018. Camera ready version. 14 page, 5 figures, 3
table
Estimation of Fiber Orientations Using Neighborhood Information
Data from diffusion magnetic resonance imaging (dMRI) can be used to
reconstruct fiber tracts, for example, in muscle and white matter. Estimation
of fiber orientations (FOs) is a crucial step in the reconstruction process and
these estimates can be corrupted by noise. In this paper, a new method called
Fiber Orientation Reconstruction using Neighborhood Information (FORNI) is
described and shown to reduce the effects of noise and improve FO estimation
performance by incorporating spatial consistency. FORNI uses a fixed tensor
basis to model the diffusion weighted signals, which has the advantage of
providing an explicit relationship between the basis vectors and the FOs. FO
spatial coherence is encouraged using weighted l1-norm regularization terms,
which contain the interaction of directional information between neighbor
voxels. Data fidelity is encouraged using a squared error between the observed
and reconstructed diffusion weighted signals. After appropriate weighting of
these competing objectives, the resulting objective function is minimized using
a block coordinate descent algorithm, and a straightforward parallelization
strategy is used to speed up processing. Experiments were performed on a
digital crossing phantom, ex vivo tongue dMRI data, and in vivo brain dMRI data
for both qualitative and quantitative evaluation. The results demonstrate that
FORNI improves the quality of FO estimation over other state of the art
algorithms.Comment: Journal paper accepted in Medical Image Analysis. 35 pages and 16
figure
Comparative Evaluation of Action Recognition Methods via Riemannian Manifolds, Fisher Vectors and GMMs: Ideal and Challenging Conditions
We present a comparative evaluation of various techniques for action
recognition while keeping as many variables as possible controlled. We employ
two categories of Riemannian manifolds: symmetric positive definite matrices
and linear subspaces. For both categories we use their corresponding nearest
neighbour classifiers, kernels, and recent kernelised sparse representations.
We compare against traditional action recognition techniques based on Gaussian
mixture models and Fisher vectors (FVs). We evaluate these action recognition
techniques under ideal conditions, as well as their sensitivity in more
challenging conditions (variations in scale and translation). Despite recent
advancements for handling manifolds, manifold based techniques obtain the
lowest performance and their kernel representations are more unstable in the
presence of challenging conditions. The FV approach obtains the highest
accuracy under ideal conditions. Moreover, FV best deals with moderate scale
and translation changes
Second-order Democratic Aggregation
Aggregated second-order features extracted from deep convolutional networks
have been shown to be effective for texture generation, fine-grained
recognition, material classification, and scene understanding. In this paper,
we study a class of orderless aggregation functions designed to minimize
interference or equalize contributions in the context of second-order features
and we show that they can be computed just as efficiently as their first-order
counterparts and they have favorable properties over aggregation by summation.
Another line of work has shown that matrix power normalization after
aggregation can significantly improve the generalization of second-order
representations. We show that matrix power normalization implicitly equalizes
contributions during aggregation thus establishing a connection between matrix
normalization techniques and prior work on minimizing interference. Based on
the analysis we present {\gamma}-democratic aggregators that interpolate
between sum ({\gamma}=1) and democratic pooling ({\gamma}=0) outperforming both
on several classification tasks. Moreover, unlike power normalization, the
{\gamma}-democratic aggregations can be computed in a low dimensional space by
sketching that allows the use of very high-dimensional second-order features.
This results in a state-of-the-art performance on several datasets
PIEMAP: Personalized Inverse Eikonal Model from cardiac Electro-Anatomical Maps
Electroanatomical mapping, a keystone diagnostic tool in cardiac
electrophysiology studies, can provide high-density maps of the local electric
properties of the tissue. It is therefore tempting to use such data to better
individualize current patient-specific models of the heart through a data
assimilation procedure and to extract potentially insightful information such
as conduction properties. Parameter identification for state-of-the-art cardiac
models is however a challenging task. In this work, we introduce a novel
inverse problem for inferring the anisotropic structure of the conductivity
tensor, that is fiber orientation and conduction velocity along and across
fibers, of an eikonal model for cardiac activation. The proposed method, named
PIEMAP, performed robustly with synthetic data and showed promising results
with clinical data. These results suggest that PIEMAP could be a useful
supplement in future clinical workflows of personalized therapies.Comment: 12 pages, 4 figures, 1 tabl
Riemannian Sparse Coding for Positive Definite Matrices
International audienceInspired by the great success of sparse coding for vector valued data, our goal is to represent symmetric positive definite (SPD) data matrices as sparse linear combinations of atoms from a dictionary, where each atom itself is an SPD matrix. Since SPD matrices follow a non-Euclidean (in fact a Riemannian) geometry, existing sparse coding techniques for Euclidean data cannot be directly extended. Prior works have approached this problem by defining a sparse coding loss function using either extrinsic similarity measures (such as the log-Euclidean distance) or kernelized variants of statistical measures (such as the Stein divergence, Jeffrey's divergence, etc.). In contrast, we propose to use the intrinsic Riemannian distance on the manifold of SPD matrices. Our main contribution is a novel mathematical model for sparse coding of SPD matrices; we also present a computationally simple algorithm for optimizing our model. Experiments on several computer vision datasets showcase superior classification and retrieval performance compared with state-of-the-art approaches
Simultaneous Denoising and Motion Estimation for Low-dose Gated PET using a Siamese Adversarial Network with Gate-to-Gate Consistency Learning
Gating is commonly used in PET imaging to reduce respiratory motion blurring
and facilitate more sophisticated motion correction methods. In the
applications of low dose PET, however, reducing injection dose causes increased
noise and reduces signal-to-noise ratio (SNR), subsequently corrupting the
motion estimation/correction steps, causing inferior image quality. To tackle
these issues, we first propose a Siamese adversarial network (SAN) that can
efficiently recover high dose gated image volume from low dose gated image
volume. To ensure the appearance consistency between the recovered gated
volumes, we then utilize a pre-trained motion estimation network incorporated
into SAN that enables the constraint of gate-to-gate (G2G) consistency. With
high-quality recovered gated volumes, gate-to-gate motion vectors can be
simultaneously outputted from the motion estimation network. Comprehensive
evaluations on a low dose gated PET dataset of 29 subjects demonstrate that our
method can effectively recover the low dose gated PET volumes, with an average
PSNR of 37.16 and SSIM of 0.97, and simultaneously generate robust motion
estimation that could benefit subsequent motion corrections.Comment: Accepted at MICCAI 202
Automated diffeomorphic registration of anatomical structures with rigid parts: application to dynamic cervical MRI.
International audienceWe propose an iterative two-step method to compute a diffeomorphic non-rigid transformation between images of anatomical structures with rigid parts, without any user intervention or prior knowledge on the image intensities. First we compute spatially sparse, locally optimal rigid transformations between the two images using a new block matching strategy and an efficient numerical optimiser (BOBYQA). Then we derive a dense, regularised velocity field based on these local transformations using matrix logarithms and M-smoothing. These two steps are iterated until convergence and the final diffeomorphic transformation is defined as the exponential of the accumulated velocity field. We show our algorithm to outperform the state-of-the-art log-domain diffeomorphic demons method on dynamic cervical MRI data
- …